package DP_1143;

public class Solution {
	public int longestCommonSubsequence(String text1, String text2) {
		char[] t1 = text1.toCharArray();
		char[] t2 = text2.toCharArray();
		int l1 = t1.length;
		int l2 = t2.length;
		int[][] dp = new int[l1+1][l2+1];
		for (int i = 1; i <= t1.length; i++) {
			for (int j = 1; j <= t2.length; j++) {
				if (t1[i - 1] == t2[j - 1]) {
					dp[i][j] = dp[i - 1][j - 1] + 1;
				} else {
					dp[i][j] = Math.max(dp[i - 1][j], dp[i][j-1]);
				}

			}
		}
		return dp[l1][l2];

	}
}
